Representing first-order causal theories by logic programs
نویسندگان
چکیده
منابع مشابه
Representing first-order causal theories by logic programs
Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain’s embedding of definite propositional causal theories into logic programming paved the way to the use of answer set solvers for answering queries about actions described in such languages. In this paper we extend this embedding to nondefinite ...
متن کاملTranslating First-Order Theories into Logic Programs
This paper focuses on computing first-order theories under either stable model semantics or circumscription. A reduction from first-order theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is also given. Having such reduction and embedding, reasoning problems represented by first-order theor...
متن کاملCausal Theories as Logic Programs
We show how we can rewrite any causal theory — under the semantics of causal logic due to McCain and Turner — as a logic program in the answer set semantics. Using this translation the models of any causal theory can be computed using answer set solvers.
متن کاملFrom Causal Theories to Logic Programs (Sometimes)
In this paper, we shall provide a translation of a class of causal theories in (Lin 3]) to Gelfond and Lifschitz's disjunctive logic programs with classical negation 1]. We found this translation interesting for at least the following two reasons: it provides a basis on which a wide class of causal theories in ((3]) can be computed; and it sheds some new lights on the nature of the causal theor...
متن کاملApproximate Reasoning in First-Order Logic Theories
Many computational settings are concerned with finding (all) models of a first-order logic theory for a fixed, finite domain. In this paper, we present a method to compute from a given theory and finite domain an approximate structure: a structure that approximates all models. We show confluence of this method and investigate its complexity. We discuss some applications, including 3-valued quer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2011
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068411000081